Principally Unimodular Skew-Symmetric Matrices
نویسندگان
چکیده
منابع مشابه
Principally Unimodular Skew-Symmetric Matrices
A square matrix is principally unimodular if every principal submatrix has determinant 0 or 1. Let A be a symmetric (0; 1)-matrix, with a zero diagonal. A PU-orientation of A is a skew-symmetric signing of A that is PU. If A 0 is a PU-orientation of A, then, by a certain decomposition of A, we can construct every PU-orientation of A from A 0. This construction is based on the fact that the PU-o...
متن کاملCommutators of Skew-Symmetric Matrices
In this paper we develop a theory for analysing the size of a Lie bracket or commutator in a matrix Lie algebra. Complete details are given for the Lie algebra so(n) of skew symmetric matrices. 1 Norms and commutators in Mn[R] and so(n) This paper is concerned with the following question. Let g be a Lie algebra (Carter, Segal & Macdonald 1995, Humphreys 1978, Varadarajan 1984). Given X,Y ∈ g an...
متن کاملOn skew-symmetric differentiation matrices
The theme of this paper is the construction of finite-difference approximations to the first derivative in the presence of Dirichlet boundary conditions. Stable implementation of splitting-based discretisation methods for the convectiondiffusion equation requires the underlying matrix to be skew symmetric and this turns out to be a surprisingly restrictive condition. We prove that no skewsymmet...
متن کاملSkew-symmetric Matrices and Palatini Scrolls
We prove that, for m greater than 3 and k greater than m−2, the Grassmannian of m-dimensional subspaces of the space of skew-symmetric forms over a vector space of dimension 2k is birational to the Hilbert scheme of Palatini scrolls in P. For m = 3 and k > 3, this Grassmannian is proved to be birational to the set of pairs (E , Y ), where Y is a smooth plane curve of degree k and E is a stable ...
متن کاملMatroid Matching Via Mixed Skew-Symmetric Matrices
Tutte associates a V by V skew-symmetric matrix T , having indeterminate entries, with a graph G=(V,E). This matrix, called the Tutte matrix, has rank exactly twice the size of a maximum cardinality matching of G. Thus, to find the size of a maximum matching it suffices to compute the rank of T . We consider the more general problem of computing the rank of T +K where K is a real V by V skew-sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1998
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s004930050033